Network Structural Transformation-Based Community Detection with Autoencoder
نویسندگان
چکیده
منابع مشابه
3D Keypoint Detection Based on Deep Neural Network with Sparse Autoencoder
Researchers have proposed various methods to extract 3D keypoints from the surface of 3D mesh models over the last decades, but most of them are based on geometric methods, which lack enough flexibility to meet the requirements for various applications. In this paper, we propose a new method on the basis of deep learning by formulating the 3D keypoint detection as a regression problem using dee...
متن کاملOutlier Detection with Autoencoder Ensembles
In this paper, we introduce autoencoder ensembles for unsupervised outlier detection. One problem with neural networks is that they are sensitive to noise and often require large data sets to work robustly, while increasing data size makes them slow. As a result, there are only a few existing works in the literature on the use of neural networks in outlier detection. This paper shows that neura...
متن کاملOverlapping Community Detection based on Network Decomposition
Community detection in complex network has become a vital step to understand the structure and dynamics of networks in various fields. However, traditional node clustering and relatively new proposed link clustering methods have inherent drawbacks to discover overlapping communities. Node clustering is inadequate to capture the pervasive overlaps, while link clustering is often criticized due t...
متن کاملCommunity detection based on a semantic network
0950-7051/$ see front matter 2011 Elsevier B.V. A doi:10.1016/j.knosys.2011.06.014 ⇑ Corresponding author. E-mail address: [email protected] (Z. Xia As information technology has advanced, people are turning more frequently to electronic media for communication, and social relationships are increasingly found in online channels. Massive amounts of the real data collected from online soci...
متن کاملCommunity detection based on network communicability.
We propose a new method for detecting communities based on the concept of communicability between nodes in a complex network. This method, designated as N-ComBa K-means, uses a normalized version of the adjacency matrix to build the communicability matrix and then applies K-means clustering to find the communities in a graph. We analyze how this method performs for some pathological cases found...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2020
ISSN: 2073-8994
DOI: 10.3390/sym12060944